منابع مشابه
A Graph based approach for Co-scheduling jobs on Multi-core computers
In a multicore processor system, running multiple applications on different cores in the same chip could cause resource contention, which leads to performance degradation. Recent studies have shown that job co-scheduling can effectively reduce the contention. However, most existing co-schedulers do not aim to find the optimal co-scheduling solution. It is very useful to know the optimal co-sche...
متن کاملGood jobs, bad jobs, and trade liberalization
☆ Much of this paper was written while Davis wa employed by, the Federal Reserve Bank of New York. The are those of the authors and do not necessarily refle Reserve Bank of New York or the Federal Reserve Syste Elhanan Helpman and Oleg Itskhoki for very helpful co this paper, and to seminar participants at Columbia, For and the NBER. ⁎ Corresponding author at: Department of Economi York, NY 100...
متن کاملStressful jobs and non-stressful jobs: a cluster analysis of office jobs.
The purpose of the study was to determine if office jobs could be characterized by a small number of combinations of stressors that could be related to job-title information and self-report of psychological strain. Two-hundred-and-sixty-two office workers from three public service organizations provided data on nine job stressors and seven indicators of psychological strain. Using cluster analy...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملScheduling jobs with chain precedence constraints and deteriorating jobs
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Royal College of Psychiatrists
سال: 1987
ISSN: 0140-0789,2514-9954
DOI: 10.1192/s0140078900024469